A Uniied Model for Similarity Searching ?
نویسندگان
چکیده
The indexing algorithms and data structures for similarity searching in metric spaces seem to emerge from a great diversity, and diierent approaches have been proposed and analyzed separately, often under diierent assumptions. Currently, the only realistic way to compare two diierent algorithms is to apply them to the same data set. We present a uniied model for studying similarity searching algorithms, deening common complexity measures allowing comparison between different approaches.
منابع مشابه
Model for Similarity Searching ?
The indexing algorithms and data structures for similarity searching in metric spaces seem to emerge from a great diversity, and diierent approaches have been proposed and analyzed separately, often under diierent assumptions. Currently, the only realistic way to compare two diierent algorithms is to apply them to the same data set. We present a uniied model for studying similarity searching al...
متن کاملShape Similarity Matching for Query - by - ExampleBilge
This paper describes a uniied approach for 2-D shape matching and similarity ranking of objects by means of a modal representation. In particular, we propose a new shape-similarity metric in the eigen-shape space for object/image retrieval from a visual database via query-by-example. This diiers from prior work which performed point correspondence determination and similarity ranking of shapes ...
متن کاملImproving Performance of Protein Structure Similarity Searching by Distributing Computations in Hierarchical Multi-Agent System
Since protein structure similarity searching is very complex and time-consuming, one of the possible acceleration methods is parallelization by distributing the calculation on multiple computers. In the paper, we present a theoretical model of the hierarchical multi-agent system dedicated to the task of protein structure similarity searching. We also show results of several numerical experiment...
متن کاملChemical Similarity Searching
This paper reviews the use of similarity searching in chemical databases. It begins by introducing the concept of similarity searching, differentiating it from the more common substructure searching, and then discusses the current generation of fragment-based measures that are used for searching chemical structure databases. The next sections focus upon two of the principal characteristics of a...
متن کاملComparative Study of Probability Models for Compound SinIilarity Searching
The quality of a chemical retrieval system heavily depends on its molecular similarity function which returns a similarity measurement between the target compound and each molecule in the collection. Compounds are sorted according to their similarity values with the query and those with high ranks are returned to the users. Most current chemical retrieval systems use the vector space model for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008